Concavity properties and a generating function for stirling numbers
نویسندگان
چکیده
منابع مشابه
Log-concavity of Stirling Numbers and Unimodality of Stirling Distributions
A series of inequalities involving Stirling numbers of the first and second kinds with adjacent indices are obtained. Some of them show log-concavity of Stirling numbers in three different directions. The inequalities are used to prove unimodality or strong unimodality of all the subfamilies of Stirling probability functions. Some additional applications are also presented.
متن کاملOn Log-concavity of a Class of Generalized Stirling Numbers
This paper considers the generalized Stirling numbers of the first and second kinds. First, we show that the sequences of the above generalized Stirling numbers are both log-concave under some mild conditions. Then, we show that some polynomials related to the above generalized Stirling numbers are q-log-concave or q-log-convex under suitable conditions. We further discuss the log-convexity of ...
متن کاملA Colorful Involution for the Generating Function for Signed Stirling Numbers of the First Kind
We show how the generating function for signed Stirling numbers of the first kind can be proved using the involution principle and a natural combinatorial interpretation based on cycle-colored permuations. We seek an involution-based proof of the generating function for signed Stirling numbers of the first kind, written here as ∑ k (−1)c(n, k)x = (−1)(x)(x− 1) · · · (x− n+ 1) where c(n, k) is t...
متن کاملA Note on the Generating Function for the Stirling Numbers of the First Kind
In this short note, we present a simple constructive proof for the generating function for the unsigned Stirling numbers of the first kind using the equidistribution of pilots and cycles of permutations.
متن کاملGenerating Functions for Extended Stirling Numbers of the First Kind
In this paper we extend the definition of Stirling numbers of the first kind by way of a special multiset. This results in a family of number triangles for which we show how to obtain ordinary generating functions for the rows and exponential generating functions for the columns. The latter are derived via a recursive process. We also indicate how to obtain formulas, in terms of factorials, gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1968
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(68)80057-2